On the Maximum Common Embedded Subtree Problem for Ordered Trees
نویسندگان
چکیده
The maximum common embedded subtree problem, which generalizes the minor containment problem on trees, is reduced for ordered trees to a variant of the longest common subsequence problem. While the maximum common embedded subtree problem is known to be APX-hard for unordered trees, an exact solution for ordered trees can be found in polynomial time. In this paper, the longest common balanced sequence problem, and thus the maximum common embedded subtree problem, are solved in O(n1n2 min(d1, 1)min(d2, 2)) time, on ordered trees with n1 and n2 nodes, of depth d1 and d2, and with 1 and 2 leaves.
منابع مشابه
Faster Algorithms for the Maximum Common Subtree Isomorphism Problem
The maximum common subtree isomorphism problem asks for the largest possible isomorphism between subtrees of two given input trees. This problem is a natural restriction of the maximum common subgraph problem, which is NP-hard in general graphs. Confining to trees renders polynomial time algorithms possible and is of fundamental importance for approaches on more general graph classes. Various v...
متن کاملEnumerating All Maximal Frequent Subtrees
Given a collection of leaf-labeled trees on a common leafset and a fraction f in (1/2,1], a frequent subtree (FST) is a subtree isomorphically included in at least fraction f of the input trees. The well-known maximum agreement subtree (MAST) problem identifies FST with f = 1 and having the largest number of leaves. Apart from its intrinsic interest from the algorithmic perspective, MAST has pr...
متن کاملEvoMiner: Frequent Subtree Mining in Phylogenetic Databases Technical Report #11-08, Dept. of Computer Science, Iowa State University
The problem of mining collections of trees to identify common patterns, called frequent subtrees (FSTs), arises often when trying to make sense of the results of phylogenetic analysis. FST mining generalizes the well-known maximum agreement subtree problem. Here we present EvoMiner, a new algorithm for mining frequent subtrees in collections of phylogenetic trees. EvoMiner is an Apriori-like le...
متن کاملKaikoura Information Processing Letters tree theorems : Computing the maximum agreement subtree
The Maximum Agreement Subtree Problem was posed by Finden and Gordon in 1985, and is as follows: given a set S={s,, sz,..., s,,} and two trees P and Q leaf-labelled by the elements of S, find a maximum cardinality subset S, of S such that PI S, = Q IS,. This problem arises in evolutionary tree construction, where different methods or data yield (possibly) different trees for the same species on...
متن کاملA method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کامل